home *** CD-ROM | disk | FTP | other *** search
- M"'(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)
- 'o(O)
- '(O)o
- 'o(O) n0107 - Question B
- '(O)o
- 'o(O) Lowest Common Multiple
- '(O)o
- 'o(O)
- '(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)
-
-
- @WeightingScore 9,1,1,1
-
- @atGraphic 36,14
- @Picture numbers\n0107a.bmp
-
- @at 100,20
- Find the #blowest common #
- #bmultiple# of the following
- numbers:
- @at 10,+8
- #^ #p6# #^ #p5# #^ #p10#
-
- @at 10,+62
- Which method do you want to practice?
- @at ,+6
- Listing the #bmultiples# of each number...
- @at ,+4
- Using #bprime numbers#...
-
- @MultMode 2
- @atGraphic 214,156
- @Loop 2
- @HSPicture uncheck.bmp,check.bmp
- @atGraphic ,172
- @EndLoop
-
- @Answer 0,2
- @Feedback 0
- @FBMGoto Method_2
- @Answer 0,1
-
- '||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
-
-
- @Question
-
- @at 10,+32
- What's the first step?
- @at ,+3
- #[K]
-
- @keyPointAnswer 1,185,multiply by 2
-
- @KeyPointFeedback 0,Wrong option
- The first step will be to find all the
- factors of each number.
-
-
- '|||||||||||||||||||/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||||||||||||||||||||
-
- @Question
-
- @NewPage
- @atGraphic 36,14
- @Picture numbers\n0107a.bmp
-
- @at 100,20
- Find the #blowest common #
- #bmultiple# of the following
- numbers:
- @at 10,+8
- #^ #^ #p6# #^ #p5# #^ #p10#
-
- @InputWidth 20
- @at ,+2
- #T╫2 #T#[N]#T#[N]#T#[N]
- @MarkPos 1
-
- @Answer 1, 12,10,20
-
- @Feedback E0.33,?,?,?
- That's partly right.*
- @Feedback 0,?,?,?
-
- @FeedbackC 1, 6 ╫ 2 = #b12#
- @FeedbackC 2, 5 ╫ 2 = #b10#
- @FeedbackC 3,10 ╫ 2 = #b20#
- @FeedbackC 0,
- @FeedbackC 0,Always check your answers.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
- @Question
-
- @at 10,+140
- What's the next step?
- @at ,+3
- #[K]
- @MarkPos 2
-
- @keyPointAnswer 1,186,multiply by one more than last time
-
- @KeyPointFeedback 0,Wrong option
- Continue finding the multiples of each number
- until you find the lowest common multiple,
- which will appear in all three lists.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
-
- @Question
-
- @GoPos 1
- @at ,+5
- #T╫3 #T#[N]#T#[N]#T#[N]
- @at ,+5
- #T╫4 #T#[N]#T#[N]#T#[N]
- @at ,+5
- #T╫5 #T#[N]#T#[N]#T#[N]
- @at ,+5
- #T╫6 #T#[N]#T#[N]#T#[N]
-
- @Answer 5, 18,15,30, 24,20,40, 30,25,50, 36,30,60
-
- @Feedback E0.4, ?,?,?,?,?,?,?,?,?,?,?,?
- @Feedback 0, ?,?,?,?,?,?,?,?,?,?,?,?
-
- @FeedbackC 0,To find the lowest common multiple of a of
- @FeedbackC 0,number, multiply them by whole numbers beginning
- @FeedbackC 0,with 2, and continuing with ╫3, ╫4, ╫5, etc. until
- @FeedbackC 0,there is a multiple common to all the numbers.*
- @FeedbackC 0,Remember to check your answers.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
- @Question
-
- @InputWidth 26
- @GoPos 1
- @at 80,+80
-
- #b Lowest#
- #bCommon Multiple#
- @at ,+3
- #[N]
-
- @Answer 1, 30
-
- @Feedback 0,?
- You should have found the lowest number in all
- the lists. #b30# is the lowest multiple common
- to all three numbers.
-
- @Feedback 1
- That's right! Well done.
-
- @Goto End_of_Question
-
-
-
- '<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/> METHOD 2 <\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>
-
-
-
- @Label Method_2
-
- @Question
-
- @at 10,+32
- What's the first step?
- @at ,+3
- #[K]
-
- @keyPointAnswer 1,187,find the prime factors of each number
-
- @KeyPointFeedback 0,Wrong option
- The first step will be to find all the
- prime factors of each number.
-
-
- '|||||||||||||||||||/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||||||||||||||||||||
-
- @NewPage
- @atGraphic 36,14
- @Picture numbers\n0107a.bmp
-
- @at 100,20
- Find the #blowest common #
- #bmultiple# of the following
- numbers:
- @at 10,+8
- #^ #p6# #^ #p5# #^ #p10#;
- #T ;
- @MarkPos 1
- #T#T ;
- @MarkPos 2
- #T#T#T ;
- @MarkPos 3
-
- @InputWidth 20
- @GoPos 1
- #^ #^;
- @Loop 2
- #T#[N];
- @at ,+17
- #T#T#[N];
- @EndLoop
-
- @Answer 1.5, 2,3,3,1
-
- @Feedback E0.375,?,?,?,?
- @Feedback 0,?,?,?,?
-
- @FeedbackC 0,To find all the prime factors of any number,
- @FeedbackC 0,first divide by the smallest prime number as
- @FeedbackC 0,many times as possible. If the number will
- @FeedbackC 0,not divide evenly, divide by the next larger
- @FeedbackC 0,prime number, and repeat until you are left
- @FeedbackC 0,with a result of 1.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
-
- @Label Next
- @Question
-
- @GoPos 1
- @at 20,+90
- The Prime Factors are...
-
- @InputWidth 14
- @GoPos 1
- @at -6,+120
- #[N];
- @at ,-10
- #[N];
- @at ,+10
- ╫ #[N];
- @at ,-10
- #[N]
-
- @Answer 0.5, 2,,3,1
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 2,1,3,
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 3,,2,1
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 3,1,2,
- @Feedback 0.5
- @FBMGoto Next
-
- @Answer 0.5, 2,,3,
- @Feedback 0.5
- @FBMGoto Next
- @answer 0.5,3,,2,
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 3,1,2,1
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 2,1,3,1
-
- @Feedback E0.125,?,?,?,?
- @Feedback 0,?,?,?,?
-
- @FeedbackC 0,Once you've worked out all the prime factors,
- @FeedbackC 0,you should rewrite each factor once, raising
- @FeedbackC 0,it to an index to show how many lots there
- @FeedbackC 0,are.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
- @Label Next
- @Question
-
- @InputWidth 20
- @GoPos 2
- #^ #^;
- @Loop 2
- #T#[N];
- @at ,+17
- #T#T#[N];
- @EndLoop
-
- @Answer 1.5, 5,1,,
-
- @Feedback E0.375,?,?,?,?,?,?
- @Feedback 0,?,?,?,?,?,?
-
- @FeedbackC 0,To find all the prime factors of any number,
- @FeedbackC 0,first divide by the smallest prime number as
- @FeedbackC 0,many times as possible. If the number will
- @FeedbackC 0,not divide evenly, divide by the next larger
- @FeedbackC 0,prime number, and repeat until you are left
- @FeedbackC 0,with a result of 1.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
-
- @Label Next
- @Question
-
- @InputWidth 14
- @GoPos 2
- @at +20,+120
- #[N];
- @at ,-10
- #[N]
-
- @Answer 0.5, 5,
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 5,1
-
- @Feedback E0.25,?,?
- @Feedback 0,?,?
-
- @FeedbackC 0,Once you've worked out all the prime factors,
- @FeedbackC 0,you should rewrite each factor once, raising
- @FeedbackC 0,it to an index to show how many lots there
- @FeedbackC 0,are.
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
-
- @Label Next
- @Question
-
- @InputWidth 20
- @GoPos 3
- #^ #^;
- @Loop 2
- #T#[N];
- @at ,+17
- #T#T#[N];
- @EndLoop
-
- @Answer 1.5, 2,5,5,1
-
- @Feedback E0.375,?,?,?,?
- @Feedback 0,?,?,?,?
-
- @FeedbackC 0,To find all the prime factors of any number,
- @FeedbackC 0,first divide by the smallest prime number as
- @FeedbackC 0,many times as possible. If the number will
- @FeedbackC 0,not divide evenly, divide by the next larger
- @FeedbackC 0,prime number, and repeat until you are left
- @FeedbackC 0,with a result of 1.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
-
- @Label Next
- @Question
-
- @InputWidth 14
- @GoPos 3
- @at +4,+120
- #[N];
- @at ,-10
- #[N];
- @at ,+10
- ╫ #[N];
- @at ,-10
- #[N]
-
-
- @Answer 0.5, 2,,5,1
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 2,1,5,
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 5,,2,1
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 5,1,2,
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 2,,5,
- @Feedback 0.5
- @FBMGoto Next
- @answer 0.5,5,,2,
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 5,1,2,1
- @Feedback 0.5
- @FBMGoto Next
- @Answer 0.5, 2,1,5,1
-
- @Feedback E0.125,?,?,?,?
- @Feedback 0,?,?,?,?
-
- @FeedbackC 0,Once you've worked out all the prime factors,
- @FeedbackC 0,you should rewrite each factor once, raising
- @FeedbackC 0,it to an index to show how many lots there
- @FeedbackC 0,are.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
- @Label Next
- @Question
-
- @at 10,280
- Now what do you do?
- @at ,+3
- #[K]
-
- @keyPointAnswer 1,188,find the product
-
- @KeyPointFeedback 0,Wrong option
- The final step is to find the product of
- each unique prime factor.
-
-
- '/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
-
- @Question
-
- @InputWidth 20
- @at 10,220
- Lowest Common Multiple =
- @at 10,+14
- #[N];
- @at ,-10
- #[N];
- @at ,+10
- ╫ #[N];
- @at ,-10
- #[N];
- @at ,+10
- ╫ #[N];
- @at ,-10
- #[N];
- @at ,+10
- = #[N]
-
- @Answer 1, 1&3&5=2|3|5, , *, , *, , 30
- @Feedback 1
- @FBMgoto Right
- @Answer 1, 1&3&5=2|3|5, 1, *, 1, *, 1, 30
-
- @Feedback 0.5, 2, 1,3, 1,5, 1, ?
- @Feedback 0.5, 2, ,3, ,5, , ?
- @FBMGoto Calc
-
- @Feedback 0,?,?,?,?,?,?,?
- To find the lowest common multiple,
- @Label Calc
- The lowest common multiple of 6, 5 and 10 is:*
- #b2ç ╫ 3ç ╫ 5ç# = #b30#
-
- @Label Right
- @Feedback 1
- That's right! Well done.
-
-
- '<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>
-
-
- @Label End_of_Question
-